Truth and knowledge fixpoint semantics for many-valued logic programming

نویسنده

  • Zoran Majkic
چکیده

The variety of semantical approaches that have been invented for logic programs for reasoning about inconsistent databases is quite broad. Especially, we are interested in an ontological encapsulation of a many-valued logics with negation, based on bilattices, into a 2-valued logic: this new approach is a minimilistic one based on the concept of the semantic reflection. We define a Model theoretic approach for Herbrand interpretations of an encapsulated logic program and the new semantics for implication of their clauses. We introduce a trilattice of Herbrand interpretations, with the third truth dimension for this ’meta’ logic (over a bilattice of the many-valued logic), where is possible to apply the KnasterTarski theorem for a truth-monotonic ’immediate consequence operator’ instead of knowledge-monotonic Fitting’s operator for a many-valued logic programs. We extend the Fitting’s fixpoint semantics for 3-valued logic programs and show the strong connection with the fixpoint semantics of ’meta’ logic programs obtained by encapsulation of many-valued programs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Many-valued Logic Programming and Fixpoint Semantics for Higher-order Herbrand Models

In this paper we compare the two versions of knowledge invariant transformations of the original Many-valued logic programs: the strict Annotated logic programs and the ’meta’ logic programs obtained by the ontological encapsulation [1]. We show that the first one has the higher-order Herbrand interpretations, while the last can be seen as the flattening of the first one. These two knowledge in...

متن کامل

Probabilistic and Truth-Functional Many-Valued Logic Programming

We introduce probabilistic many-valued logic programs in which the implication connective is interpreted as material implication. We show that probabilistic many-valued logic programming is computationally more complex than classical logic programming. More precisely, some deduction problems that are P-complete for classical logic programs are shown to be co-NP-complete for probabilistic many-v...

متن کامل

Truth Values and Connectives in Some Non-Classical Logics

The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...

متن کامل

Bilattices, Intuitionism and Truth-knowledge Duality: Concepts and Foundations

We propose a family of intuitionistic bilattices with full truth-knowledge duality (D-bilattices) for a logic programming. The first family of perfect D-bilattices is composed by Boolean algebras with even number of atoms: the simplest of them, based on intuitionistic truth-functionally complete extension of Belnap’s 4-valued bilattice, can be used in paraconsistent programming, that is, for kn...

متن کامل

Fixpoint Characterizations for Many-Valued Disjunctive Logic Programs with Probabilistic Semantics

In this paper, we continue to explore many-valued disjunctive logic programs with probabilistic semantics. In particular, we newly introduce the least model state semantics for such programs. We show that many-valued disjunctive logic programs under the semantics of minimal models, perfect models, stable models, and least model states can be unfolded to equivalent classical disjunctive logic pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005